NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
261	Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control, Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2015-09-01 20:36:26
262	11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-11-08 06:52:04 Scheduling Operations research NP-complete problems Complexity classes Combinatorial optimization Makespan Knapsack problem NP Algorithm Vertex cover Approximation algorithm Job shop scheduling
263	Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2015-12-01 10:37:13 Matching Combinatorics NP-complete problems Combinatorial optimization Spanning tree Stable marriage problem Approximation algorithm 3-dimensional matching Minimum spanning tree
264	Lev Reyzin Clique Talk, 2007   Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2009-10-27 11:25:10 Mathematics Graph coloring NP-complete problems Hypergraph Discrete mathematics Theoretical computer science
265	On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2011-07-18 11:44:43 Combinatorial optimization Graph theory NP-complete problems Network theory Edsger W. Dijkstra Steiner tree problem Simplex Matching Bipartite graph Graph Shortest path problem A* search algorithm
266	December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2009-05-07 21:09:13 Graph theory Mathematics Computational complexity theory Network theory Spanning tree NP-complete problems Edsger W. Dijkstra Shortest path problem Longest path problem Minimum spanning tree Reverse-delete algorithm
267	Bibliography [Abrams & Lloyd, 1998] Abrams, D.S., & Lloyd, SNonlinear Quantum Mechanics Implies Polynomial-Time Solution for NP-Complete and P Problems. Physical Review Letters, 81, 3992–5. [Adleman, 1994] A Add to Reading List Source URL: fab.cba.mit.edu Language: English - Date: 2016-01-31 15:31:25
268	Recovering Social Networks by Observing Votes Benjamin Fish and Yi Huang and Lev Reyzin Department of Mathematics, Statistics, & Computer Science University of Illinois at Chicago, Chicago, IL 60607 {bfish3,yihuang89,lre Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2015-12-18 15:57:04 Graph theory Bipartite graph Parity Graph Ear decomposition Matching NP-complete problems Graph coloring Line graph
269	Five $1,000 Problems - John H. Conway! ! ! ! Add to Reading List Source URL: cheswick.com Language: English - Date: 2014-10-13 09:47:48 Graph theory Graph Thrackle Path NP-complete problems Hamiltonian path Skew-symmetric graph
270	R Foundations and Trends in Theoretical Computer Science Vol. 9, No–210 c 2014 S. Sachdeva and N. K. Vishnoi Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2014-04-08 16:25:54 Mathematics Algebra Mathematical analysis Matrix theory NP-complete problems Numerical analysis Polynomial Approximation theory Pi Chebyshev polynomials Eigenvalues and eigenvectors Matrix

UPDATE